Linear Approximations of Addition Modulo 2n-1
نویسندگان
چکیده
منابع مشابه
Linear Approximations of Addition Modulo 2n
Addition modulo 2 − 1 is a basic arithmetic operation in the stream cipher ZUC. For evaluating ZUC in resistance to linear cryptanalysis, it is necessary to study properties of linear approximations of the addition modulo 2 − 1. In this paper we discuss linear approximations of the addition modulo 2 − 1 for integer n ≥ 2. As results, an exact formula on the correlations of linear approximations...
متن کاملLinear Approximations of Addition Modulo
Addition modulo 2 − 1 is a basic arithmetic operation in the stream cipher ZUC. For evaluating ZUC’s resistance against linear cryptanalysis, it is necessary to study properties of linear approximations of the addition modulo 2 − 1. In this paper we discuss linear approximations of the addition of k inputs modulo 2n− 1 for n ≥ 2. As a result, an explicit expression of the correlations of linear...
متن کاملA logarithmic-depth quantum carry-lookahead adder
We present an efficient addition circuit, borrowing techniques from the classical carry-lookahead arithmetic circuit. Our quantum carrylookahead (qcla) adder accepts two n-bit numbers and adds them in O(log n) depth using O(n) ancillary qubits. We present both in-place and out-of-place versions, as well as versions that add modulo 2n and modulo 2n − 1. Previously, the linear-depth ripple-carry ...
متن کاملA More Explicit Formula for Linear Probabilities of Modular Addition Modulo a Power of Two
Linear approximations of modular addition modulo a power of two was studied by Wallen in 2003. He presented an efficient algorithm for computing linear probabilities of modular addition. In 2013 Schulte-Geers investigated the problem from another viewpoint and derived a somewhat explicit formula for these probabilities. In this note we give a closed formula for linear probabilities of modular a...
متن کاملFast modulo 2n+1 multi-operand adders and residue generators
In this manuscript novel architectures for modulo 2 þ 1 multi-operand addition and residue generation are introduced. The proposed arithmetic components consist of a translation stage, an inverted endaround-carry carry-save-adder tree and an enhanced diminished-1 modulo 2 þ 1 adder. Qualitative and quantitative results indicate that the proposed architectures result in significantly faster and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010